Covering convex bodies by cylinders and lattice points by flats ∗
نویسنده
چکیده
In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an application we establish lower bounds on the number of k-dimensional flats (i.e. translates of k-dimensional linear subspaces) needed to cover all the integer points of a given convex body in d-dimensional Euclidean space for 1 ≤ k ≤ d − 1.
منابع مشابه
Packing Convex Bodies by Cylinders
In [BL] in relation to the unsolved Bang’s plank problem (1951) we obtained a lower bound for the sum of relevant measures of cylinders covering a given d-dimensional convex body. In this paper we provide the packing counterpart of these estimates. We also extend bounds to the case of r-fold covering and packing and show a packing analog of Falconer’s results ([Fa]).
متن کاملDeviations of Ergodic Sums for Toral Translations I. Convex Bodies
We show the existence of a limiting distribution D of the adequately normalized discrepancy function of a random translation on a torus relative to a strictly convex set. Using a correspondence between the small divisors in the Fourier series of the discrepancy function and lattices with short vectors, and mixing of diagonal flows on the space of lattices, we identify D with the distribution of...
متن کاملFaster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings
We give a 2O(n)(1+1/ε)n time and poly(n)-space deterministic algorithm for computing a (1+ε) approximation to the volume of a general convex body K, which comes close to matching the (1+c/ε)n/2 lower bound for volume estimation in the oracle model by Bárány and Füredi (STOC 1986, Proc. Amer. Math. Soc. 1988). This improves on the previous results of Dadush and Vempala (Proc. Nat’l Acad. Sci. 20...
متن کاملA Note on Covering by Convex Bodies
A classical theorem of Rogers states that for any convex body K in n-dimensional Euclidean space there exists a covering of the space by translates of K with density not exceeding n log n+n log log n+5n. Rogers’ theorem does not say anything about the structure of such a covering. We show that for sufficiently large values of n the same bound can be attained by a covering which is the union of ...
متن کاملCovering space with convex bodies
1. A few years ago Rogers [1] showed that, if K is any convex body in n-dimensional Euclidian space, there is a covering of the whole space by translates of K with density less than nlogn+nloglogn+5n, provided n > 3. However the fact that the covering density is reasonably small does not imply that the maximum multiplicity is also small. In the natural covering of space by closed cubes, the den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008